Lattices and hypergraphs associated to square-free monomial ideals

نویسندگان

چکیده

Given a square-free monomial ideal $I$ in polynomial ring $R$ over field $\mathbb{K}$, one can associate it with its LCM-lattice and hypergraph. In this short note, we establish the connection between hypergraph, doing so provide sufficient condition for removing higher dimension edges of hypergraph without impacting projective ideal. We also offer algorithms to compute class ideals built using new result previous results Lin-Mantero.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypergraphs and Regularity of Square-Free monomial ideals

We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple combinatorial properties of its labeled hypergraph. We also give specific formulas for the regularity of square-free monomial ideals with certain labeled hypergraphs. Fu...

متن کامل

Embedded Associated Primes of Powers of Square-free Monomial Ideals

An ideal I in a Noetherian ringR is normally torsion-free if Ass(R/I) = Ass(R/I) for all t ≥ 1. We develop a technique to inductively study normally torsion-free square-free monomial ideals. In particular, we show that if a squarefree monomial ideal I is minimally not normally torsion-free then the least power t such that I has embedded primes is bigger than β1, where β1 is the monomial grade o...

متن کامل

Cohen-Macaulay properties of square-free monomial ideals

In this paper we study simplicial complexes as higher dimensional graphs in order to produce algebraic statements about their facet ideals. We introduce a large class of square-free monomial ideals with Cohen-Macaulay quotients, and a criterion for the Cohen-Macaulayness of facet ideals of simplicial trees. Along the way, we generalize several concepts from graph theory to simplicial complexes.

متن کامل

Monomial Ideals, Edge Ideals of Hypergraphs, and Their Minimal Graded Free Resolutions

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a hypergraph H appears within the resolution of its edge ideal I(H). We discuss when recursive formulas to compute the graded Betti numbers of I(H) in terms of its sub...

متن کامل

Monomial Ideals Arising from Distributive Lattices

The free resolution and the Alexander dual of squarefree monomial ideals associated with certain subsets of distributive lattices are studied.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Algebra

سال: 2022

ISSN: ['1532-4125', '0092-7872']

DOI: https://doi.org/10.1080/00927872.2022.2072853